Subfield Codes of Linear Codes from Perfect Nonlinear Functions and Their Duals
نویسندگان
چکیده
Let $\mathbb{F}_{p^m}$ be a finite field with $p^m$ elements, where $p$ is an odd prime and $m$ positive integer. Recently, \cite{Hengar} \cite{Wang2020} determined the weight distributions of subfield codes form $$\mathcal{C}_f=\left\{\left(\left( {\rm Tr}_1^m(a f(x)+bx)+c\right)_{x \in \mathbb{F}_{p^m}}, Tr}_1^m(a)\right)\, : \, a,b \mathbb{F}_{p^m}, c \mathbb{F}_p\right\}$$ for $f(x)=x^2$ $f(x)=x^{p^k+1}$, respectively, $k$ nonnegative In this paper, we further investigate code $\mathcal{C}_f$ $f(x)$ being known perfect nonlinear function over generalize some results in \cite{Hengar,Wang2020}. The constructed are by applying theory quadratic forms properties functions fields. addition, parameters duals these also determined. Several examples show that our their have best respect to tables \cite{MGrassl}. The proposed optimal Sphere Packing bound if $p\geq 5$.
منابع مشابه
Quantum codes from affine variety codes and their subfield-subcodes
We use affine variety codes and their subfield-subcodes for obtaining quantum stabilizer codes via the CSS code construction. With this procedure we get codes with good parameters, some of them exceeding the quantum Gilbert-Varshamov bound given by Feng and Ma.
متن کاملLinear codes with complementary duals
A linear code with a complementary dual (or an LCD code) is defined to be a linear code C whose dual code C⊥ satisfies C ∩ C⊥ = {0}. The algebraic characterization of LCD codes is given, and it is shown that asymptotically good LCD codes exist. LCD codes are shown to provide an optimum linear coding solution for the two-user binary adder channel. The nearest-neighbor (or maximum-likelihood) dec...
متن کاملMinimal Trellises for Linear Block Codes and Their Duals
We consider the problem of finding a trellis for a linear block code that minimizes one or more measures of trellis complexity for a fixed permutation of the code. We examine constraints on trellises, including relationships between the minimal trellis of a code and that of the dual code. We identify the primitive structures that can appear in a minimal trellis and relate this to those for the ...
متن کاملTail-biting Trellises for Linear Codes and their Duals
Trellis representations of linear block codes are attractive because of their use in soft decision decoding algorithms. An interesting property that is known for conventional trellises is that the minimal conventional trellis (known to be unique) for a linear block code, and its dual have the same state-complexity profile. This interesting property follows from the BCJR construction [1] of the ...
متن کاملBinary quasi-perfect linear codes from APN quadratic functions
A mapping f from F2m to itself is almost perfect nonlinear (APN) if its directional derivatives in nonzero directions are all 2-to-1. Let Cf be the binary linear code of length 2 − 1, whose parity check matrix has its j-th column [ π f(π) ] , where π is a primitive element in F2m and j = 0, 1, · · · , 2 − 2. For m ≥ 3 and any quadratic APN function f(x) = ∑m−1 i,j=0 ai,jx 2+2 , ai,j ∈ F2m , it ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Mathematical Research
سال: 2022
ISSN: ['1674-5647', '2707-8523']
DOI: https://doi.org/10.4208/cmr.2020-0520